Angelic Verification: Precise Verification Modulo Unknowns

نویسندگان

  • Ankush Das
  • Shuvendu K. Lahiri
  • Akash Lal
  • Yi Li
چکیده

Verification of open programs can be challenging in the presence of an unconstrained environment. Verifying properties that depend on the environment yields a large class of uninteresting false alarms. Using a verifier on a program thus requires extensive initial investment in modeling the environment of the program. We propose a technique called angelic verification for verification of open programs, where we constrain a verifier to report warnings only when no acceptable environment specification exists to prove the assertion. Our framework is parametric in a vocabulary and a set of angelic assertions that allows a user to configure the tool. We describe a few instantiations of the framework and an evaluation on a set of real-world benchmarks to show that our technique is competitive with industrial-strength tools even without models of the environment.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Synthesizing Safe Bit-Precise Invariants

Bit-precise software verification is an important and difficult problem. While there has been an amazing progress in SAT solving, Satisfiability Modulo Theory of Bit Vectors, and bit-precise Bounded Model Checking, proving bit-precise safety, i.e. synthesizing a safe inductive invariant, remains a challenge. Although the problem is decidable and is reducible to propositional safety by bit-blast...

متن کامل

SAT Modulo BDD -- A Combined Verification Approach for Incomplete Designs

We introduce a novel method that integrates BDD-based symbolic model checking into SAT-based bounded model checking in the presence of unknowns. By incorporating both distinctively different methods, our new hybrid verification tool can take advantage of what each type of model checking has to offer. We present a case study for which both the BDD-based method as well as the SAT-based method are...

متن کامل

Games and Winning Strategies

'ILvo-person games are modeled as specifications in a language with angelic and demonic nondeterminism, and methods of program verification and transformation are used to reason about games. That a given strategy is winning can be proved using a variant of the traditional loop correctness rule. Furthermore, an implementation of the winning strategy can be derived using equivalence transformations.

متن کامل

Towards Precise and Scalable Verification of Embedded Software

Inspired by the success of model checking in hardware verification and protocol analysis, there has been growing interest in research and development of tools for the automated verification of software. This paper provides an overview of our efforts towards achieving precise and scalable verification of embedded software in a model checking-based verification platform called F-SOFT. We combine ...

متن کامل

Using Exciting and Spectral Envelope Information and Matrix Quantization for Improvement of the Speaker Verification Systems

Speaker verification from talking a few words of sentences has many applications. Many methods as DTW, HMM, VQ and MQ can be used for speaker verification. We applied MQ for its precise, reliable and robust performance with computational simplicity. We also used pitch frequency and log gain contour for further improvement of the system performance.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015